In his list of open problems, Martin Erickson described a certain game: "Twoplayers alternately put queens on an n x n chess board so that each new queenis not in range of any queen already on the board (the color of the queens isunimportant). The last player who can move wins." Then he asked: "Who shouldwin?" Obviously, for n up to 3, the first player wins, if he does not miss to startat the central position in the case n=3. In this article, we give very simple always winning strategies for the firstplayer if n is 4 or odd. The additionally (in the source package) provided computer program QPGAME3has been used to check that there are successful strategies for the firstplayer if n is 6 or 8, and for the second player if n is 10, 12, 14, or 16. As discovered during the submission process of the first version of thisarticle, Hassan A Noon presented consistent results concerning values of nwhich are odd or at most 10, in his B.A. thesis and, together with Glen VanBrummelen, in a journal article.
展开▼
机译：在他的未解决问题列表中，马丁·埃里克森（Martin Erickson）描述了一种特定的游戏：“两人交替将皇后放在nxn棋盘上，这样，每个新皇后都不会在棋盘上已经出现任何皇后的范围内（皇后的颜色不重要）。最后一个可以移动的球员获胜。”然后他问：“谁应该赢？”显然，对于n最多为3的情况，如果在n = 3的情况下没有错过从中心位置开始的位置，则第一个玩家会获胜。在本文中，如果n为4或奇数，我们将为第一人给出非常简单的始终获胜策略。 （在源包中）另外提供的计算机程序QPGAME3已用于检查如果n为6或8，则第一名玩家是否成功，如果n为10、12、14或16，则第二名玩家是否成功。在本文第一版的提交过程中，Hassan A Noon在他的文学士学位课程中对n的奇数或至多10的值给出了一致的结果论文，并与Glen VanBrummelen一起发表在期刊文章上。
展开▼
